Semantic-driven Generation with LFG- and PATR-style Grammars

نویسنده

  • Jürgen Wedekind
چکیده

To find an appropriate utterance for a semantic representation is a problem normally treated in the domain of (tactical) natural language generation. For unification-based approaches, like LFG, PATR, or HPSG (Kaplan and Bresnan 1982; Shieber et al. 1983; Pollard and Sag 1994), this problem turns out to be a formal problem of the underlying grammar formalism, when the mapping between strings and semantic representations is defined by the grammar. Semantic representations are then encoded in a separate part of the feature structures (henceforth f-structures) that are assigned to the sentences by the grammar. This is normally achieved by a distinct attribute SF.M (or an additional a-projection that is formally reconstructable by such an attribute) whose value is intended to represent the semantics of the sentence the f-structure is assigned to. The f-structure given in (1), which might be assigned to the sentence John arrives by a unification grammar for English, is a simple example.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ambiguity-preserving Generation with LFG- and PATR-style Grammars

The widespread ambiguity of natural language presents a particular challenge for machine translation. The translation of an ambiguous source sentence may depend on first determining which reading of the sentence is contextually appropriate and then producing a target sentence that accurately expresses that reading. This may be difficult or even impossible to accomplish when resolution of the so...

متن کامل

Some Remarks on the Decidability of the Generation Problem in LFG- and PATR-Style Unification Grammars

In this paper, we prove the decidability of the generation problem for those unification grammars which are based on contextfree phrase structure rule skeletons, like e.g. LFG and PATR-II. The result shows a perhaps unexpected asymmetry, since it is valid also for those unification grammars whose parsing problem is undecidable, e.g. grammars which do not satisfy the off-line parsability constra...

متن کامل

LFG Generation Produces Context-free Languages

This paper examines the generation problem for a certain linguistically relevant subclass of LFG grammars. Our main result is that the set of strings that such a grammar relates to a particular f-structure is a context-free language. This result obviously extends to other context-free based grammatical formalisms, such as PATR, and also to formalisms that permit a context-free skeleton to be ex...

متن کامل

On the Universal Generation Problem for Unification Grammars

The universal generation problem for unification grammars is the problem of determining whether a given grammar derives any terminal string with a given feature structure. It is known that the problem is decidable for LFG and PATR grammars if only acyclic feature structures are taken into consideration. In this brief note, we show that the problem is undecidable for cyclic structures. This hold...

متن کامل

Generation as structure driven derivation

This paper describes two algorithms which construct two different types of generators for lexical functional grammars (LFGs). The first type generates sentences from functional structures and the second from semantic structures. The latter works on the basis of extended LFGs, which contain a mapping from f-structures into semantic structures. Both algorithms can be used on all grammars within t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computational Linguistics

دوره 25  شماره 

صفحات  -

تاریخ انتشار 1999